首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11028篇
  免费   1092篇
  国内免费   882篇
化学   2110篇
晶体学   27篇
力学   809篇
综合类   247篇
数学   7154篇
物理学   2655篇
  2024年   13篇
  2023年   114篇
  2022年   117篇
  2021年   228篇
  2020年   305篇
  2019年   305篇
  2018年   292篇
  2017年   351篇
  2016年   430篇
  2015年   273篇
  2014年   528篇
  2013年   1008篇
  2012年   463篇
  2011年   651篇
  2010年   602篇
  2009年   675篇
  2008年   704篇
  2007年   709篇
  2006年   630篇
  2005年   562篇
  2004年   513篇
  2003年   487篇
  2002年   466篇
  2001年   377篇
  2000年   338篇
  1999年   290篇
  1998年   272篇
  1997年   214篇
  1996年   183篇
  1995年   159篇
  1994年   104篇
  1993年   93篇
  1992年   83篇
  1991年   80篇
  1990年   41篇
  1989年   47篇
  1988年   34篇
  1987年   23篇
  1986年   30篇
  1985年   32篇
  1984年   26篇
  1983年   15篇
  1982年   21篇
  1981年   20篇
  1980年   16篇
  1979年   19篇
  1978年   13篇
  1977年   16篇
  1976年   8篇
  1973年   7篇
排序方式: 共有10000条查询结果,搜索用时 348 毫秒
991.
We give short elementary proofs of a formula of Ramanujan as interpreted by Bradley, and a companion formula originally proved by W. Chu. We also give an elementary proof of a generalization of an identity originally proved using modular functions and used to study a generating function for the number of partitions with specified crank. Research partially supported by NSF grant DMS 99-70865. 2000 Mathematics Subject Classification Primary—39A70, 11P83; Secondary—33C20  相似文献   
992.
Let G = (V,E) be a simple graph with n vertices, e edges and d1 be the highest degree. Further let λi, i = 1,2,...,n be the non-increasing eigenvalues of the Laplacian matrix of the graph G. In this paper, we obtain the following result: For connected graph G, λ2 = λ3 = ... =  λn-1 if and only if G is a complete graph or a star graph or a (d1,d1) complete bipartite graph. Also we establish the following upper bound for the number of spanning trees of G on n, e and d1 only:
The equality holds if and only if G is a star graph or a complete graph. Earlier bounds by Grimmett [5], Grone and Merris [6], Nosal [11], and Kelmans [2] were sharp for complete graphs only. Also our bound depends on n, e and d1 only. This work was done while the author was doing postdoctoral research in LRI, Université Paris-XI, Orsay, France.  相似文献   
993.
给出了左C-半群的另一种结构,所谓左交错积结构,并刻画了它的特殊情形.这种结构为左C-半群在广义正则半群类中的再推广奠定了基础.  相似文献   
994.
Lianshun Zhang 《Optik》2007,118(2):53-56
We report on the development of a method that records spatially dependent intensity patterns of polarized light that arise from illuminating a turbid media with a polarized laser beam and being diffusely backscattered. Our technique employs polarized light from a He-Ne laser () which is focused onto the surface of the scattering medium. A surface area of approximately 2×2 cm centered on the light input point is imaged through polarization analysis optics onto a CCD camera. The Mueller matrix is reconstructed by 49 intensity measurements with various orientations of polarizer and analyzer. The measured Mueller matrix of polystyrene spheres was compared with the theory result of incoherent scattering of light by spheres. The experimental and theory results are in excellent agreement. It appears that the azimuthal patterns of the Mueller matrix are determined by the symmetry of the turbid media.  相似文献   
995.
《Discrete Mathematics》2023,346(6):113373
The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers (2019) [9], we characterize all connected graphs with exactly one positive anti-adjacency eigenvalue, which is an analog of Smith's classical result that a connected graph has exactly one positive adjacency eigenvalue iff it is a complete multipartite graph. On this basis, we identify the connected graphs with all but at most two anti-adjacency eigenvalues equal to ?2 and 0. Moreover, for the anti-adjacency matrix we determine the HL-index of graphs with exactly one positive anti-adjacency eigenvalue, where the HL-index measures how large in absolute value may be the median eigenvalues of a graph. We finally propose some problems for further study.  相似文献   
996.
设Xi是无穷维复Banach空间, L(Xj,Xi)是Xj到Xi上的有界线性算子全体.考虑 n × n 上三角算子矩阵T=(Tij)1≤j≤n, 其中Tij L(Xj,Xi),1≤j≤n; Tij=0, i>j.本文研究了T的单值扩张性, 通过考察集合S(T)={λ∈C}: T在点λ没有SVEP},证明了S(T)在i=1 ? nS(Ti)中退化,进而给出等式S(T)=i=1 ? n S(Ti)成立的条件. 同时, 考察了T的单值扩张性扰动,得到了S(T)保持对角稳定时Ti所需的条件并予以证明, 同时举例说明这些条件的合理性.最后, 给出单值扩张性关于谱σ(T)和局部谱σT (x)的应用, 得到了谱扰动和局部谱扰动不变的新条件.  相似文献   
997.
严凡  林莉  金士杰 《应用声学》2023,42(3):523-528
针对单测量向量模型(Single Measurement Vector,SMV)等传统压缩感知方法处理超声全矩阵数据时,存在重构精度低和重构耗时长等问题,本文研究了多测量向量模型(Multiple Measurement Vectors,MMV)应用的可行性。针对铝合金试块中不同深度的φ2 mm横通孔,分别使用MMV模型中的多测量稀疏贝叶斯(Multiple Sparse Bayesian Learning,MSBL)算法和SMV模型中的稀疏贝叶斯(Sparse Bayesian Learning,SBL)算法进行超声全矩阵数据重构,并实施全聚焦成像。随后,引入归一化均方误差和阵列性能因子评价图像和信号的重构效果。实验结果表明,SBL算法在25%采样率时的归一化均方误差为1.9%,而MSBL算法仅需15%采样率即可达到相似效果且耗时更少。  相似文献   
998.
The problem of finite-time stabilizing control design for state-dependent impulsive dynamical linear systems (SD-IDLS) is tackled in this paper. Such systems are characterized by continuous-time, linear, possibly time-varying, dynamics coupled with discrete-time, linear, possibly time-varying, dynamics. The continuous-time part determines the system evolution in any time interval between two consecutive resetting events, while the discrete-time part governs its instantaneous state jump whenever the system trajectory intersects a resetting set, i.e. a region of the state space assumed to be time-independent. By making use of a quadratic control Lyapunov function, the finite-time stabilization of SD-IDLS through a static output feedback control design is specifically discussed in this paper. A sufficient and constructive result is provided based on the conical hulls of the resetting set subregions and on some cone copositivity properties of the chosen control Lyapunov function. Such a result is based on the solution of a feasibility problem that involves a set of coupled Difference/Differential Linear Matrix Inequalities (D/DLMI), which is shown to be less conservative and more numerically amenable with respect to other results available in the literature. An example illustrates the effectiveness of the proposed approach.  相似文献   
999.
提出分块波前法求解非对称大型有限元方程组,该方法综合分块解法和波前法的优点,根据计算机容量和方程的阶数优化计算过程,以在经济效率和存储效率之间达到平衡。本文利用该方法求解了轮胎稳态滚动有限元方程组,表明该方法是有效、可靠的。  相似文献   
1000.
本文讨论了含有均匀基体裂纹的正交复合材料对称层合板的线性粘弹性力学行为.采用二维剪切滞后模型并对其层间剪应力在厚度方向进行线性假设分布,求得层合板的平均应力应变的线弹性解,利用等效约束模型和经典层合理论可得到层合板因为含有基体裂纹而所引起的刚度退化现象.在弹性-粘弹性对应原理的基础上对其层合板的线粘弹性进行了讨论和研究.结果表明:层合板的松弛模量和蠕变泊松比随着时间的增加而减少,到达稳态后其值基本上是恒值.并跟Zocher的解析解和有限元数值解作了比较,发现结果非常吻合.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号